Minimum norm problems over transportation polytopes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graphs of transportation polytopes

Article history: Received 17 October 2007 Available online 28 April 2009

متن کامل

Some efficiently solvable problems over integer partition polytopes

The integer partition polytope Pn is the convex hull of all integer partitions of n. We provide a novel extended formulation of Pn, and use it to show that the extremality, adjacency, and separation problems over Pn can be solved by linear programming without the ellipsoid method. © 2014 Elsevier B.V. All rights reserved.

متن کامل

On the Minimum Norm

This paper describes a new technique to nd the minimum norm solution of a linear program. The main idea is to reformulate this problem as an unconstrained minimization problem with a convex and smooth objective function. The minimization of this objective function can be carried out by a Newton-type method which is shown to be globally convergent. Furthermore, under certain assumptions, this Ne...

متن کامل

Information-geometric equivalence of transportation polytopes

This paper deals with transportation polytopes in the probability simplex (that is, sets of categorical bivariate probability distributions with prescribed marginals). Information projections between such polytopes are studied, and a sufficient condition is described under which these mappings are homeomorphisms. 1. Preliminaries Let Γn denote the set of probability distributions with alphabet ...

متن کامل

Optimizing over Semimetric Polytopes

called the triangle inequalities. The paper deals with the problem of finding efficient algorithms to optimize a linear function over such a polytope. We briefly mention two reasons to seek for an efficient way to optimize a linear function over M(G). 1. The polytope M(G), for |V | > 4, properly contains the cut polytope associated with G (see, e.g., [5] for the details). Thus, if an edge cost ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1980

ISSN: 0024-3795

DOI: 10.1016/0024-3795(80)90211-6